On computational complexity of set automata
نویسندگان
چکیده
We consider a computational model which is known as set automata. The automata are one-way finite with additional storage—the set. There two kinds of automata—deterministic (DSA's) and nondeterministic (NSA's). was introduced by Kutrib, Malcher, Wendlandt in 2014. It shown that DSA-recognizable languages look similar to DCFL's NSA-recognizable CFL's. In this paper, we extend similarity prove recognizable NSA's form rational cone, do main topic paper complexity: DSA's belong P there P-complete among them; NP NP-complete the word membership problem for without ε-loops PSPACE-complete general DSA's; emptiness DSA's.
منابع مشابه
On Computational Complexity of Set Automata
We consider a computational model which is known as set automata. A set automaton is a one-way finite automata with an additional storage the set. There are two kind of set automatathe deterministic and the nondeterministic ones. We denote them as DSA and NSA respectively. DSA were presented by M. Kutrib, A. Malcher, M. Wendlandt in 2014 in [1] and [2]. This model seems to be interesting becaus...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn the computational complexity of partial word automata problems
We consider computational complexity of problems related to partial word automata. Roughly speaking, a partial word is a word in which some positions are unspecified, and a partial word automaton is a finite automaton that accepts a partial word language— here the unspecified positions in the word are represented by a “hole” symbol ⋄. A partial word language L can be transformed into an ordinar...
متن کاملOn the Computational Complexity of Approximating Distributions by Probabilistic Automata
45 If we divide the path set for u i into 1 and 1 , deened as before, then if we let M be an arbitrary canonical matrix, we can show the following
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information & Computation
سال: 2021
ISSN: ['0890-5401', '1090-2651']
DOI: https://doi.org/10.1016/j.ic.2021.104797